Algorithms for determining relative inclusion star height and inclusion star height
نویسندگان
چکیده
منابع مشابه
Desert Automata V. On the Complexity of the Relative Inclusion Star Height Problem
Given a family of recognizable languages L1, . . . , Lm and recognizable languages K1 ⊆ K2, the relative inclusion star height problem means to compute the minimal star height of some rational expression r over L1, . . . , Lm satisfying K1 ⊆ L(r) ⊆ K2. We show that this problem is of elementary complexity and give a detailed analysis its complexity depending on the representation of K1 and K2 a...
متن کاملThe Generalized Star-Height Problem
The minimal number of nested Kleene stars required in a regular expression representing a language provides a simple complexity measure on the regular languages. For restricted regular expressions in which complementation is not allowed, much is known about the measure. In particular, Eggan(1963) showed that for any n, there is a language of star-height n[1]. Hashiguchi(1983) then gave a method...
متن کاملDistance Desert Automata and Star Height Substitutions
We introduce the notion of nested distance desert automata as a joint generalization and further development of distance automata and desert automata. We show that limitedness of nested distance desert automata is PSPACE-complete. As an application, we show that it is decidable in 22 O(n2) space whether the language accepted by an n-state non-deterministic automaton is of a star height less tha...
متن کاملInclusion of Height and Limb Length when Interpreting Sympathetic Skin Response
It is more than a decade since scientists are making use of sympathetic skin response (SSR) as a clinical and research method to evaluate sympathetic nervous system. A major portion of the efferent pathway of this response is composed of non-myelinated nerves. Thus, the latency of the response may be significantly different in normal individuals with different height and limb lengths. This stud...
متن کاملThe solution of two star height problems for regular trees
Regular trees can he detined by two types of rational exprwions. For these two types w;isolve the star-height problem, i.e., we show how to construct a rational expression of minimal star-height from the minimal graph of the given tree (i.e., the analogue of the minimal deterministic automaton for regular languages). In one case, the minimal starheight is the rank (in the Sense of Eggan) of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90269-8